Solupals - Textbook Solutions


9.12 Suppose that G = (V, E) is a tree, s is the root, and we add a vertex t and edgesof infinite capacity from all leaves in G to t. Give a linear-time algorithm to find a maximum flow from s to t. -
 
 
View Solution
 
 
 
<< Back Next >>